Linear array pattern synthesis optimizing array element excitations using the simulated annealing technique

1999 ◽  
Vol 23 (4) ◽  
pp. 224-226 ◽  
Author(s):  
J. A. Rodr�guez ◽  
F. Ares ◽  
E. Moreno
Keyword(s):  
Simulated Annealing ◽  
Linear Array ◽  
Array Element ◽  
Pattern Synthesis ◽  
Array Pattern

scholarly journals Linear Array Pattern Synthesis Using An Improved Multiobjective Genetic Algorithm

2017 ◽  
Vol 26 (4) ◽  
pp. 1048-1059 ◽  
Author(s):  
C. Han ◽  
L. Wang ◽  
Z. Zhang ◽  
J. Xie ◽  
Z. Xing
Keyword(s):  
Genetic Algorithm ◽  
Linear Array ◽  
Pattern Synthesis ◽  
Multiobjective Genetic Algorithm ◽  
Array Pattern

Synthesizing Pattern with Broad Nulls through Orthogonal Method

2010 ◽  
Vol 121-122 ◽  
pp. 992-995
Author(s):  
Long Yang Huang ◽  
Wei Jun Pan
Keyword(s):  
Linear Array ◽  
Experimental Results ◽  
Uniform Linear Array ◽  
Pattern Synthesis ◽  
Steering Vector ◽  
Orthogonal Method ◽  
First Order ◽  
Orthogonalization Method ◽  
Array Pattern ◽  
Schmidt Orthogonalization

Based on the Gram-Schmidt orthogonalization method utilized for pattern synthesis of linear array without constraints, null derivative constraints are proposed to implement pattern synthesis with broad nulls. The advantage of the simplified computation resulted from steering vector orthogonalization in unconstrained orthogonal approach is maintained, and the uniform or non-uniform linear array pattern synthesis can be realized by this method. The experimental results show that the null constrained orthogonal approach can fulfill linear array pattern synthesis with constrains such as null constrains, first-order and second-order derivative null constraints.

Sign in / Sign up

Export Citation Format

Share Document